State Machine Replication with Byzantine Faults
نویسنده
چکیده
This chapter gives an introduction to protocols for state-machine replication in groups that are connected by asynchronous networks and whose members are subject to arbitrary or “Byzantine” faults. It explains the principles of such protocols and covers the following topics: broadcast primitives, distributed cryptosystems, randomized Byzantine agreement protocols, and atomic broadcast protocols.
منابع مشابه
Reconnguration and Transient Recovery in State-machine Architectures
We consider an architecture for ultra-dependable operation based on synchronized state machine replication, extended to provide transient recovery and reconnguration in the presence of Byzantine faults. The architecture allows processors suspected of being faulty to be placed on \probation." Processors in this status cannot disrupt other processors, but those that are nonfaulty or recovering fr...
متن کاملBrief Announcement: Practical Synchronous Byzantine Consensus
This paper presents new protocols for Byzantine state machine replication and Byzantine agreement in the synchronous and authenticated setting. The PBFT state machine replication protocol tolerates f Byzantine faults in an asynchronous setting using n = 3f + 1 replicas. We improve the Byzantine fault tolerance to n = 2f + 1 by utilizing the synchrony assumption. Our protocol also solves synchro...
متن کاملImplementing Fault-Tolerant Services Using State Machines: Beyond Replication
This paper describes a method to implement fault-tolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines uses a combination of coding theory and replication to ensure efficiency as well as savings in storage and messages during normal operations. Fused state machines may incur higher overhead during recovery from crash or Byzantine ...
متن کاملTradeoffs in Byzantine-Fault-Tolerant State-Machine-Replication Protocol Design
Many state-machine-replication protocols perform the same tasks of tolerating Byzantine faults and guaranteeing consistency in an asynchronous environment. However, each protocol seems uniquely complex in part because commonalities are lost in descriptions of the protocols. In this paper, we identify Byzantine quorum systems as a unifying factor in the design of each protocol. Leveraging this, ...
متن کاملUsing Virtualization Technology for Fault-Tolerant Replication in LAN
We present an architecture and an algorithm for Byzantine faulttolerant state machine replication. Our algorithm explores the advantages of virtualization to reliably detect and tolerate faulty replicas, allowing the transformation of Byzantine faults into omission faults. Our approach reduces the total number of physical replicas from 3f+1 to 2f+1. Our approach is based on the concept of twin ...
متن کامل